K-CYCLIC EVEN CYCLE SYSTEMS OF THE COMPLETE GRAPH

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Existence of cyclic k-cycle systems of the complete graph

Starting from earliest papers by Rosa we solve, directly and explicitly, the existence problem for cyclic k-cycle systems of the complete graph Kv with v ≡ 1 (mod 2k), and the existence problem for cyclic k-cycle systems of the complete m-partite graph Km×k with m and k being odd. As a particular consequence, a cyclic p-cycle system of Kv with p being a prime exists for all admissible values of...

متن کامل

Cyclic Hamiltonian cycle systems of the complete graph

We prove that there exists a cyclic Hamiltonian k-cycle system of the complete graph if and only if k is odd but k = 15 and p with p prime and ¿ 1. As a consequence we have the existence of a cyclic k-cycle system of the complete graph on km vertices for any pair (k; m) of odd integers with k as above but (k; m) = (3; 3). c © 2003 Elsevier B.V. All rights reserved.

متن کامل

Cyclic hamiltonian cycle systems of the complete graph minus a 1-factor

In this paper, we prove that cyclic hamiltonian cycle systems of the complete graph minus a 1-factor, Kn − I, exist if and only if n ≡ 2, 4( mod 8) and n 6= 2p with p prime and α ≥ 1.

متن کامل

Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph

In this paper, we prove that directed cyclic hamiltonian cycle systems of the complete symmetric digraph, K∗ n, exist if and only if n ≡ 2 (mod 4) and n 6= 2p with p prime and α ≥ 1. We also show that directed cyclic hamiltonian cycle systems of the complete symmetric digraph minus a set of n/2 vertex-independent digons, (Kn− I)∗, exist if and only if n ≡ 0 (mod 4).

متن کامل

Cycle decompositions of the complete graph

For a positive integer n, let G be Kn if n is odd and Kn less a one-factor if n is even. In this paper it is shown that, for non-negative integers p, q and r, there is a decomposition of G into p 4-cycles, q 6-cycles and r 8-cycles if 4p+6q+8r = |E(G)|, q = 0 if n < 6 and r = 0 if n < 8.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Taiwanese Journal of Mathematics

سال: 2008

ISSN: 1027-5487

DOI: 10.11650/twjm/1500602493